Towards NEXP versus BPP?
نویسنده
چکیده
We outline two plausible approaches to improving the miserable state of affairs regarding lower bounds against probabilistic polynomial time (namely, the class BPP).
منابع مشابه
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space f gn to the set of truth tables of easy Boolean functions on logn variables as well as using some known hardness randomness tradeo s we establish a number of results relating the complexity of exponential time and probabilistic polynomial time complexity classes In particular we show that NEXP P poly NEXP MA this can be interpreted as saying that no derandomization ...
متن کاملLimits on the Computational Power of Random Strings
Let C(x) and K(x) denote plain and prefix Kolmogorov complexity, respectively, and let RC and RK denote the sets of strings that are “random” according to these measures; both RK and RC are undecidable. Earlier work has shown that every set in NEXP is in NP relative to both RK and RC , and that every set in BPP is polynomial-time truth-table reducible to both RK and RC [ABK06a, BFKL10]. (All of...
متن کاملBPP , Proof systems
We currently do not have a very good unconditional bound on the power of BPP — in particular, it could be that BPP = NEXP. Perhaps surprisingly, especially in light of the many randomized algorithms known, the current conjecture is that BPP is not more powerful than P. We will return to this point later in the semester when we talk about derandomization. What (unconditional) upper bounds can we...
متن کاملCuriouser and Curiouser: The Link between Incompressibility and Complexity
This talk centers around some audacious conjectures that attempt to forge firm links between computational complexity classes and the study of Kolmogorov complexity. More specifically, let R denote the set of Kolmogorov-random strings. Let BPP denote the class of problems that can be solved with negligible error by probabilistic polynomial-time computations, and let NEXP denote the class of pro...
متن کاملUnconditional Lower Bounds against Advice
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including: 1. For any constant c, NEXP 6⊆ P c]/nc 2. For any constant c, MAEXP 6⊆ MA/nc 3. BPEXP 6⊆ BPP/n It was previously unknown even whether NEXP ⊆ NP/n. For the probabilistic classes, no lower bounds for uniform exponential time against advice were known before. We also cons...
متن کامل